Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
731	How to transform a List Coloring problem into a Traveling Salesman one DRAFT[removed]removed] Abstract This paper describes a method to transform a List Coloring Problem (LCP) into a Traveling Add to Reading List Source URL: clerc.maurice.free.fr Language: English - Date: 2012-11-29 03:08:56 NP-complete problems Travelling salesman problem Graph coloring Hamiltonian path Connectivity Edge coloring Bellman–Ford algorithm Graph theory Theoretical computer science Mathematics
732	On the Multiple Gene Duplication Problem Michael Fellows1, Michael Hallett2 , and Ulrike Stege2 1 2 Dep. of Computer Science, Univ. of Victoria, Victoria, B.C. Canada V8W 3P6 Add to Reading List Source URL: taxonomy.zoology.gla.ac.uk Language: English - Date: 2007-07-24 12:39:54 Tree Binary tree Geometric group theory Group theory NP-complete problems Graph theory Theoretical computer science Mathematics
733	June[removed]C3P 913 Performance of Dynamic Load Balancing Algorithms for Unstructured Mesh Add to Reading List Source URL: www.ligo.caltech.edu Language: English - Date: 2002-09-04 11:24:40 Parallel computing Graph coloring NP-complete problems Distributed algorithms Distributed computing Parallel algorithm Simulated annealing Distributed memory Computer cluster Concurrent computing Computing Computer programming
734	11276_2007_45_14_5-web[removed] Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2010-04-22 03:22:33 Routing algorithms Network theory Wireless networking Routing protocols NP-complete problems Geographic routing Routing Shortest path problem Unit disk graph Graph theory Mathematics Theoretical computer science
735	What Cannot Be Computed Locally!∗ Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-05-29 12:05:51 Graph theory NP-complete problems Spanning tree Connectivity Graph coloring R-tree B-tree Degree Tree Theoretical computer science Mathematics Computational complexity theory
736	On the Locality of Bounded Growth Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-05-19 08:04:24 NP-complete problems Graph coloring Search algorithms Connectivity Unit disk graph Nearest neighbor search Distributed computing Connected component Dominating set Theoretical computer science Graph theory Mathematics
737	CSPs Classical results Semi-Definite programming Inapproximability results Classification Final words Add to Reading List Source URL: www.nada.kth.se Language: English - Date: 2007-09-24 02:56:24 NP-complete problems Combinatorial optimization Operations research Cut Graph connectivity Maximum cut Approximation algorithm Semidefinite programming Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
738	Unit Disk Graph Approximation∗ Fabian Kuhn Thomas Moscibroda Roger Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-08-11 12:11:55 Graph Connectivity Topology Graph coloring Petersen graph Planar separator theorem Graph theory NP-complete problems Unit disk graph
739	Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs Fabian Kuhn1 , Thomas Moscibroda1 , Tim Nieberg2? , and Roger Wattenhofer1 1 Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2005-07-24 07:43:23 NP-complete problems Analysis of algorithms Probabilistic complexity theory Randomized algorithm Connectivity Topology Unit disk graph Graph coloring Breadth-first search Graph theory Theoretical computer science Mathematics
740	Virtual Coordinates for Ad Hoc and Sensor Networks Thomas Moscibroda Regina O‘Dell Mirjam Wattenhofer Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2004-10-11 04:26:00 Wireless sensor network ETH Zurich Connectivity Switzerland Wireless networking NP-complete problems Unit disk graph

UPDATE